Works by Steven S. Muchnick

( view other items matching `Steven S. Muchnick`, view all matches )
6 found
Order:
  1.  3
    [Omnibus Review].Steven S. Muchnick - 1977 - Journal of Symbolic Logic 42 (3):422-423.
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  5
    The Vectorized Grzegorczyk Hierarchy.Steven S. Muchnick - 1976 - Mathematical Logic Quarterly 22 (1):441-480.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  31
    The Vectorized Grzegorczyk Hierarchy.Steven S. Muchnick - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):441-480.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  14
    A. Bertoni. Mathematical methods of the theory of stochastic automata. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 9–22. - R. V. Freivald. Functions computable in the limit by probabilistic machines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 77–87. - B. Goetze and R. Klette. Some properties of limit recursive functions. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 88–90. - Ole-Johan Dahl. An approach to correctness proofs of semicoroutines. [REVIEW]Steven S. Muchnick - 1977 - Journal of Symbolic Logic 42 (3):422-423.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  28
    Courcelle B.. Equational theories and equivalences of programs. Mathematical logic in computer science, edited by Dömölki B. and Gergely T., Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 289–302.de Barker J. W. and Zucker J. I.. Derivatives of programs. Mathematical logic in computer science, edited by Dömölki B. and Gergely T., Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 321–343.Engeler E.. An algorithmic model of strict finitism. Mathematical logic in computer science, edited by Dömölki B. and Gergely T., Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 345–357. [REVIEW]Steven S. Muchnick - 1984 - Journal of Symbolic Logic 49 (3):990-991.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Review: B. Courcelle, B. Domolki, T. Gergely, Equational Theories and Equivalences of Programs; J. W. de Bakker, J. I. Zucker, Derivatives of Programs; E. Engeler, An Algorithmic Model of Strict Finitism. [REVIEW]Steven S. Muchnick - 1984 - Journal of Symbolic Logic 49 (3):990-991.
     
    Export citation  
     
    Bookmark